Model and Program Repair via Group Actions

Abstract Given a textual representation of finite-state concurrent program $$P$$ P , one can construct the corresponding Kripke structure $$\mathcal {M}$$ M . However, size be exponentially larger than This state explosion make model checking properties via expensive or even infeasible. The action symmetry group $$G$$ G on used to produce smaller $$\overline{\mathcal {M}}$$ ¯ Various authors have exploited direct correspondence between and perform checking. When does not satisfy formula, look for substructure that will formula. We call this substructure-repair : identifying {N}$$ N satisfies given temporal logic In paper we extend previous work by showing repairs lift other words, repair computer which exhibits high degree symmetry, repairing then symmetrizing program. To do arrange substructures into lattices are ordered inclusion. show preserved form (sub)lattice maps lattice restricted “maximal” with above map is isomorphism. These results enable us cases where has such as in many programs, small